Long Cycles Generate the Cycle Space of a Graph
نویسندگان
چکیده
منابع مشابه
Cycle Vector Space Algorithms for Enumerating All Cycles of a Planar Graph
We present a new and elegant cycle vector space algorithm that runs in O(n 2) steps and needs O(n) space for enumerating all the cycles of a planar graph with n vertices, where is the total number of simple cycles in the graph. Unlike backtrack algorithms, cycle vector space algorithms for this problem are suitable for parallelization. A parallel version of this algorithm along with a parallel ...
متن کاملDisjoint long cycles in a graph
We prove that if G is a graph of order at least 2k with k 9 and the minimum degree of G is at least k + 1, then G contains two vertex-disjoint cycles of order at least k. Moreover, the condition on the minimum degree is sharp.
متن کاملOn the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملThe Cycle Space of an Infinite Graph
Finite graph homology may seem trivial, but for infinite graphs things become interesting. We present a new approach that builds the cycle space of a graph not on its finite cycles but on its topological circles, the homeomorphic images of the unit circle in the space formed by the graph together with its ends. Our approach permits the extension to infinite graphs of standard results about fini...
متن کاملOn the Cycle Space of a 3–Connected Graph
We give a simple proof of Tutte’s theorem stating that the cycle space of a 3–connected graph is generated by the set of non-separating circuits of the graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1983
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(83)80018-3